Density Estimation with Mercer Kernels
نویسنده
چکیده
We present a new method for density estimation based on Mercer kernels. The density estimate can be understood as the density induced on a data manifold by a mixture of Gaussians fit in a feature space. As is usual, the feature space and data manifold are defined with any suitable positive-definite kernel function. We modify the standard EM algorithm for mixtures of Gaussians to infer the parameters of the density. One benefit of the approach is it’s conceptual simplicity, and uniform applicability over many different types of data. Preliminary results are presented for a number of simple problems.
منابع مشابه
The Cauchy–Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels
This paper contributes a tutorial level discussion of some interesting properties of the recent Cauchy–Schwarz (CS) divergence measure between probability density functions. This measure brings together elements from several different machine learning fields, namely information theory, graph theory and Mercer kernel and spectral theory. These connections are revealed when estimating the CS dive...
متن کاملMixture Density Mercer Kernels: A Method to Learn Kernels Directly from Data
This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian mixture density estimate. We show how to convert the ensemble estimates into a Mercer Kernel, describe the properties of this new kernel function, and give examples of the performance of this kernel on unsupervised clustering of synthe...
متن کاملDensity Estimation of Censored Data with Infinite-Order Kernels
Higher-order accurate density estimation under random right censorship is achieved using kernel estimators from a family of infinite-order kernels. A compatible bandwidth selection procedure is also proposed that automatically adapts to level of smoothness of the underlying lifetime density. The combination of infinite-order kernels with the new bandwidth selection procedure produces a consider...
متن کاملHigher-Order Polyspectral Estimation with Flat-Top Lag-Windows
Improved performance in higher-order spectral density estimation is achieved using a general class of infinite-order kernels. These estimates are asymptotically less biased but with the same order of variance as compared to the classical estimators with second-order kernels. A simple, data-dependent algorithm for selecting bandwidth is introduced and is shown to be consistent with estimating th...
متن کاملKernel-type density estimation on the unit interval
We consider kernel-type methods for estimation of a density on [0, 1] which eschew explicit boundary correction. Our starting point is the successful implementation of beta kernel density estimators of Chen (1999). We propose and investigate two alternatives. For the first, we reverse the roles of estimation point x and datapoint Xi in each summand of the estimator. For the second, we provide k...
متن کامل